Hierarchical distributed reference counting

Distributed Cyclic Reference Counting

We present a distributed cyclic reference counting algorithm which incorporates both, the correct management of cyclic data structures and the improvement of lazy mark-scan. The algorithm allows processors to run local mark-scan simultaneously without any need of synchronisation between phases of di erent local mark-scans either on the same processor or on di erent processors.

Fault-Tolerant Reference Counting for Garbage Collection in Distributed Systems

The function of a garbage collector in a computer system is to reclaim storage that is no longer in use. Developing a garbage collector for a distributed system composed of autonomous computers (nodes) connected by a communication network poses a challenging problem: optimising performance whilst achieving fault-tolerance. The paper presents the design and implementation of a reference-count ga...

Real-Time Reference Counting

Real-time software is commonly written in low level languages such as C and assembler. Such software is often hard to test, maintain, and port to other platforms. To improve this situation, high level languages are introduced in the real-time domain. The Java programming language has many properties that are appealing to real-time system development, e.g. robustness and portability. However, it...

Generational Cyclic Reference Counting

Critical Reference Counting

In traditional languages such as Pascal, C and C++ the management of allocation and deallocation of memory is left to the programmer. Leaving such a task to the programmer is error prone and cumbersome. In many recent programming languages the compiler performs this task for the programmer. However compiler-writers often implement automatic memory management as an add-on, going out of their way...